Efficient relaxations for joint chance constrained AC optimal power flow
نویسندگان
چکیده
منابع مشابه
Convex Relaxations of Chance Constrained AC Optimal Power Flow
High penetration of renewable energy sources and the increasing share of stochastic loads require the explicit representation of uncertainty in tools such as the optimal power flow (OPF). Current approaches follow either a linearized approach or an iterative approximation of non-linearities. This paper proposes a semidefinite relaxation of a chance constrained AC-OPF which is able to provide gu...
متن کاملA Generalized Framework for Chance-constrained Optimal Power Flow
Deregulated energy markets, demand forecasting, and the continuously increasing share of renewable energy sources call—among others—for a structured consideration of uncertainties in optimal power flow problems. The main challenge is to guarantee power balance while maintaining economic and secure operation. In the presence of Gaussian uncertainties affine feedback policies are known to be viab...
متن کاملConvex Relaxations of Probabilistic AC Optimal Power Flow for Interconnected AC and HVDC Grids
High Voltage Direct Current (HVDC) lines and grids interconnect AC grids to increase reliability, facilitate integration of electricity markets and connect offshore wind generation. To address the growing uncertainty in the operation of such systems and fully utilize HVDC control capabilities, this work proposes a semidefinite relaxation of a chance constrained AC optimal power flow (OPF) for i...
متن کاملChance Constraints for Improving the Security of AC Optimal Power Flow
This paper presents a scalable method for improving the solutions of AC Optimal Power Flow (AC OPF) with respect to deviations in predicted power injections from wind and other uncertain generation resources. The focus of the paper is on providing solutions that are more robust to short-term deviations, and which optimize both the initial operating point and a parametrized response policy for c...
متن کاملConvex relaxations of chance constrained optimization problems
In this paper we develop convex relaxations of chance constrained optimization problems in order to obtain lower bounds on the optimal value. Unlike existing statistical lower bounding techniques, our approach is designed to provide deterministic lower bounds. We show that a version of the proposed scheme leads to a tractable convex relaxation when the chance constraint function is affine with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electric Power Systems Research
سال: 2017
ISSN: 0378-7796
DOI: 10.1016/j.epsr.2017.04.001